Exploiting SML for Experimenting with Algebraic Algorithms: The Example of p-adic Lifting
نویسندگان
چکیده
This paper shows the expressive power of the functional programming language Standard ML (SML) in the context of computer algebra. It is focused on a special application of the p-adic lifting technique, the Hensel algorithm, that is utilized in a symbolic but also numeric context. This experiment demonstrates that SML provides a suitable frame for the implementation of abstract algebraic notions together with the possibility to code related algorithms in a generic way on the corresponding level of abstraction. 2
منابع مشابه
The Newton Polygon of Gauss-Heilbronn Sums
Let p be a prime, Zp the ring of p-adic integers, Qp the field of p-adic numbers, and Qp the algebraic closure of Qp. Let Fp be the algebraic closure of the finite field Fp, and ω : Fp → Qp the Techmüller lifting. Let q = pa, χ a multiplicative character of Fq into Q, and ψ a character of Zp[μq−1] into Q of exact order pn > 1, where μr is the set of r-th roots of unity in Qp. For simplicity, we...
متن کاملComplex multiplication and canonical lifts
The problem of constructing CM invariants of higher dimensional abelian varieties presents significant new challenges relative to CM constructions in dimension 1. Algorithms for p-adic canonical lifts give rise to very efficient means of constructing high-precision approximations to CM points on moduli spaces of abelian varieties. In particular, algorithms for 2-adic and 3-adic lifting of Frobe...
متن کاملA p-Adic View of the Algebraic Decoding of Lifted Golay Codes
The perfect Golay codes lifted over the finite rings Z2m and Z3m, or over their infinite counterparts, namely the 2-adic and 3-adic rings, are considered, and their algebraic decoding is obtained as a non-trivial extension of the algebraic decoding of the perfect Golay codes. Mathematics Subject Classification: 94B15, 94B35, 11D88, 14G50
متن کاملCan We Optimize Toeplitz/Hankel Computations?
The classical and intensively studied problem of solving a Toeplitz/Hankel linear system of equations is omnipresent in computations in sciences, engineering and communication. Its equivalent formulations include computing polynomial gcd and lcm, Padé approximation, and BerlekampMassey’s problem of recovering the linear recurrence coefficients. To improve the current record asymptotic bit opera...
متن کاملHigher Rank Case of Dwork
Dedicated to the memory of Bernard Dwork 1. Introduction In this series of two papers, we prove the p-adic meromorphic continuation of the pure slope L-functions arising from the slope decomposition of an overconvergent F-crystal, as conjectured by Dwork 6]. More precisely, we prove a suitable extension of Dwork's conjecture in our more general setting of-modules, see section 2 for precise deen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996